Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems

نویسندگان

  • Leonid Faybusovich
  • Takashi Tsuchiya
چکیده

Let g be a continuously differentiable function whose derivative is matrix monotone on positive semi-axis. Such a function induces a function φ(x) = tr(g(x)) on the cone of squares of an arbitrary Euclidean Jordan algebra. We show that φ(x)− ln det(x) is a self-concordant function on the interior of the cone. We also show that − ln(t−φ(x))−ln det(x) is √ 5 3 (r+1)-self-concordant barrier on the epigraph of φ, where r is the rank of the Jordan algebra. The case φ(x) = tr(x lnx) is discussed in detail.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EIGENVECTORS OF COVARIANCE MATRIX FOR OPTIMAL DESIGN OF STEEL FRAMES

In this paper, the discrete method of eigenvectors of covariance matrix has been used to weight minimization of steel frame structures. Eigenvectors of Covariance Matrix (ECM) algorithm is a robust and iterative method for solving optimization problems and is inspired by the CMA-ES method. Both of these methods use covariance matrix in the optimization process, but the covariance matrix calcula...

متن کامل

A review of quantum thermodynamics

In this article, we present a brief and elementary review of quantum thermodynamics and its achievements and challenges. This review includes an introduction to some fundamental concepts such as internal energy, heat, work, entropy, entropy production, thermal equilibrium, second law of quantum thermodynamics, relation between thermodynamics and information theory, as well as a discussion of ho...

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

Quantum f-divergences and error correction

Quantum f -divergences are a quantum generalization of the classical notion of f divergences, and are a special case of Petz’ quasi-entropies. Many well-known distinguishability measures of quantum states are given by, or derived from, f -divergences; special examples include the quantum relative entropy, the Rényi relative entropies, and the Chernoff and Hoeffding measures. Here we show that t...

متن کامل

Comment on “Stronger subadditivity of entropy ” by

We show how recent results of Lieb and Seiringer can be obtained from repeated use of the monotonicity of relative entropy under partial traces, and explain how to use their approach to obtain tighter bounds in many situations. In [7], Lieb and Seiringer (LS) proved an inequality which they view as stronger than the well-known strong subadditivity (SSA) of quantum entropy in a form equivalent t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2017